Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher
نویسنده
چکیده
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) showed that some context free grammars can be identified in the limit from positive data alone by identifying the congruence classes of the language. In this paper we consider learnability of context free languages using a mat. We show that there is a natural class of context free languages, that includes the class of regular languages, that can be polynomially learned from a mat, using an algorithm that is an extension of Angluin’s lstar algorithm.
منابع مشابه
Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher
We present an algorithm for the inference of some Multiple Context-Free Grammars from Membership and Equivalence Queries, using the Minimally Adequate Teacher model of Angluin. This is an extension of the congruence based methods for learning some Context-Free Grammars proposed by Clark (ICGI 2010). We define the natural extension of the syntactic congruence to tuples of strings, and demonstrat...
متن کاملEfficient, Correct, Unsupervised Learning for Context-Sensitive Languages
A central problem for NLP is grammar induction: the development of unsupervised learning algorithms for syntax. In this paper we present a lattice-theoretic representation for natural language syntax, called Distributional Lattice Grammars. These representations are objective or empiricist, based on a generalisation of distributional learning, and are capable of representing all regular languag...
متن کاملTesting Distributional Properties of Context-Free Grammars
Recent algorithms for distributional learning of context-free grammars can learn all languages defined by grammars that have certain distributional properties: the finite kernel property (fkp) and the finite context property (fcp). In this paper we present some algorithms for approximately determining whether a given grammar has one of these properties. We then present the results of some exper...
متن کاملUsing Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. We achieve this result by moving to a novel representation, called Contextual Binary Feature Grammars (CBFGs), which are capable of representing richly structured context-free languages as well as some context sensitive...
متن کاملMinimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motivated by the special structure of RSMs, we define a notion of modular visibly pushdown automata (modular VPA) and show that for the class of languages accepted by such automata, unique minimal modular VPA exist. This y...
متن کامل